

import requests
import re

# # 确定需求(url调度器)
# base_url = 'https://www.baidu.com/'
# # 发起请求(引擎)
# response = requests.get(base_url)
# # 转码
# response.encoding = 'utf-8'
# # 获取响应的结果(下载器)
# html = response.text
# print(html)
# pat = re.compile(r'<div id=u_sp class="s-isindex-wrap s-sp-menu" ><a href=http://news.baidu.com target=_blank class=mnav>新闻</a> <a href=https://www.hao123.com target=_blank class=mnav>hao123</a> <a href=http://map.baidu.com target=_blank class=mnav>地图</a> <a href=http://v.baidu.com target=_blank class=mnav>视频</a> <a href=http://tieba.baidu.com target=_blank class=mnav>贴吧</a>',re.S)
# res = pat.findall(html)
# print(res)

# for i in range(1, 10):
#     for j in range(1, i+1):
#         print(str(j)+"*"+str(i)+"="+str(i*j), end="   ")
#     print()
# for i in range(1, 10):
#     for j in range(i, 10):
#         print('%d*%d=%2d' % (i, j, i*j), end="   ")
#     print()


# list1 = [120, 230, 110, 115, 160, 130, 150, 105, 195, 155, 105, 360, 120, 120, 140,100,115,180,235,255]
# list1.sort()
# #[100, 105, 105, 110, 115, 115, 120, 120, 120, 130, 140, 150, 155, 160, 180, 195, 230, 235, 255, 360]
# print((list1[17]+list1[18])/2)

# forcast = [2.6,3.1,2.3,2.7,3.4,0.9,2.6,2.8,2.0,2.4,2.7,2.7,2.7,2.9,3.1,2.8,1.7,2.3,2.8,3.5,0.4,2.5,2.2,1.9,1.8,1.1,2.0,2.1,2.5,0.5]

# def select_sort(li):
#     for i in range(len(li)-1):
#         min_loc = i
#         for j in range(i+1, len(li)):
#             if li[j] < li[min_loc]:
#                 min_loc = j
#         if min_loc != i:
#             li[min_loc], li[i] = li[i], li[min_loc]
#         print(li)
#
# def boubble_sort(li):
#     for i in range(len(li)-1):
#         exchange = False
#         for j in range(len(li)-i-1):
#             if li[j] > li[j+1]:
#                 li[j], li[j+1] = li[j+1], li[j]
#                 exchange = True
#         print(li)
#         if not exchange:
#             return


# list1 = [120, 230, 110, 115, 160, 130, 150, 105, 195, 155, 105, 360, 120, 120, 140,100,115,180,235,255]

# boubble_sort(list1)

# select_sort(list1)


# def binary_search(li, val):
#     left = 0
#     right = len(li)-1
#     while left <= right:
#         mid = (left+right)//2
#         if li[mid] == val:
#             return mid
#         elif li[mid] > val:
#             right = mid - 1
#         else:
#             left = mid + 1
#     else:
#         return None
# l=binary_search(list1, 255)
# print(l)
import time
print(int(time.time()*1000))
































